Improvement of Convergence Condition of the Square-root Interval Method for Multiple Zeros
نویسندگان
چکیده
A new theorem concerned with the convergence of the Ostrowski-like method for the simultaneous inclusion of multiple complex zeros in circular complex arithmetic is established. Computationally verifiable initial condition that guarantees the convergence of this parallel inclusion method is significantly relaxed compared with the classical theorem stated in [Z. Angew. Math. Mech. 62 (1982), 627–630]. AMS Mathematics Subject Classification (2000): 65H05, 65G20, 30C15
منابع مشابه
The Improved Square-root Methods for the Inclusion of Multiple Zeros of Polynomials
Starting from a fixed point relation, we construct very fast iterative methods of Ostrowski-root’s type for the simultaneous inclusion of all multiple zeros of a polynomial. The proposed methods possess a great computational efficiency since the acceleration of the convergence is attained with only a few additional calculations. Using the concept of the R-order of convergence of mutually depend...
متن کاملApplication of Collocation Method in Finding Roots
In this paper we present a new method to find simple or multiple roots of functions in a finite interval. In this method using bisection method we can find an interval such that this function is one to one on it, thus we can transform problem of finding roots in this interval into an ordinary differential equation with boundary conditions. By solving this equation using collocation method we ca...
متن کاملHigher Order Methods for the Inclusion of Multiple Zeros of Polynomials
Starting from a suitable fixed point relation, we derive higher order iterative methods for the simultaneous inclusion of polynomial multiple zeros in circular complex interval arithmetic. Each of the resulting disks contain one and only one zero in every iteration. This convenient inclusion property, together with very fast convergence, ranks these methods among the most powerful iterative met...
متن کاملSquare-root Families for the Simultaneous Approximation of Polynomial Multiple Zeros
One-parameter families of iterative methods for the simultaneous determination of multiple complex zeros of a polynomial are considered. Acceleration of convergence is performed by using Newton’s and Halley’s corrections for a multiple zero. It is shown that the convergence order of the constructed total-step methods is five and six, respectively. By applying the Gauss-Seidel approach, further ...
متن کاملStructure of an Adaptive with Memory Method with Efficiency Index 2
The current research develops derivative-free family with memory methods with 100% improvement in the order of convergence. They have three parameters. The parameters are approximated and increase the convergence order from 4 to 6, 7, 7.5 and 8, respectively. Additionally, the new self-accelerating parameters are constructed by a new way. They have the properties of simple structures and they a...
متن کامل